Approach for minimal-siphon computation in S4PR
نویسندگان
چکیده
The efficient siphon computation is the key to the development of siphon-based deadlock control strategies with good performance. This work studies the computation of minimal siphons in a class of Petri nets called SPR. Firstly, we propose a function with polynomial complexity to determine whether a resource subset can generate a minimal siphon. Next, using the technique of problem partitioning, a new approach is developed to compute all minimal siphons in SPR. Finally, an example is given to illustrate the proposed approach. Keywords—Petri nets; SPR nets; minimal-siphon computation; problem partitioning
منابع مشابه
Some results on siphon computation for deadlock prevention in resource allocation systems modeled with petri nets - Emerging Technologies and Factory Automation, 2003. Proceedings. ETFA '03. IEEE Conference
Abslract-Siphons are related to liveness properties of Petri net models. This relation is strong in the case of resource allocation systems (US). Siphons can he used in these systems in order to both, characterize and preventlavoid deadlock situations. However, the Computation of these structural components can be very time consuming or, even, impassible. Moreover, if, in general, the complete ...
متن کاملAn algorithm to compute the minimal siphons in S4PR nets
Minimal siphons in the class of S4 PR nets have become a conceptual and practical central tool for the study of the resource allocation related aspects in discrete event dynamic systems as, for example, the existence of deadlocks. Therefore the availability of efficient algorithms to compute the minimal siphons is essential. In this paper we try to take advantage of the particular properties of...
متن کاملA Critical-Siphon Approach to Fastest Deadlock Controller for S3PR
The authors developed a theory to show that exactly one monitor is required for the set of siphons in the family of 2-compound siphons and how to assign its initial markings. This avoids redundant monitors and the unnecessary associated computational burden. Neither reachability graph nor minimal siphon needs to be computed to achieve polynomial complexity—essential for large systems. This chap...
متن کاملADAPTIVE FUZZY TRACKING CONTROL FOR A CLASS OF PERTURBED NONLINEARLY PARAMETERIZED SYSTEMS USING MINIMAL LEARNING PARAMETERS ALGORITHM
In this paper, an adaptive fuzzy tracking control approach is proposed for a class of single-inputsingle-output (SISO) nonlinear systems in which the unknown continuous functions may be nonlinearlyparameterized. During the controller design procedure, the fuzzy logic systems (FLS) in Mamdani type are applied to approximate the unknown continuous functions, and then, based on the minimal learnin...
متن کاملAlgorithms for Extracting Minimal Siphons Containing Specified Places in a General Petri Net
Given a Petri net PN = (P, T, E), a siphon is a set S of places such that the set of input transitions to S is included in the set of output transitions from S. Concerning extraction of minimal siphons containing a given specified set Q of places, the paper proposes three algorithms based on the branch-and-bound method for enumerating, if any, all minimal siphons containing Q, as well as for ex...
متن کامل